A Jordan Factorization Theorem for Polynomial Matrices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Multichannel Spectral Factorization Algorithm for Parahermitian Polynomial Matrices

Abstract—A novel multichannel spectral factorization algorithm is illustrated in this paper. This new algorithm is based on an iterative method for polynomial eigenvalue decomposition (PEVD) called the second order sequential best rotation (SBR2) algorithm [1]. By using the SBR2 algorithm, multichannel spectral factorization problems are simply broken down to a set of single channel problems wh...

متن کامل

An EnestrÖm-Kakeya Theorem for Hermitian Polynomial Matrices

We extend the Eneström-Kakeya theorem and its refinement by Hurwitz to polynomial matrices H(z) with positive semidefinite coefficients. We determine an annular region containing the zeros of detH(z). A stability result for systems of linear difference equations is given as an application.

متن کامل

A Factorization Theorem for Holomorphic Functions of Polynomial Growth in a Half Plane

A function F(p), p = 0, and if it is bounded by a polynomial uniformly in every half plane Rep^Q. The significance of the H+ class is due to an important theorem of L. Schwartz [l ] ; this theorem tells us tha t H+ characterizes the collection of Laplace transforms of certain distributions in D'+ (here, as in what follow...

متن کامل

On a Theorem of Jordan

The theorem of Jordan which I want to discuss here dates from 1872. It is an elementary result on finite groups of permutations. I shall first present its translations in Number Theory and Topology. 1. Statements 1.1. Number theory. Let f = ∑n m=0 amx m be a polynomial of degree n, with coefficients in Z. If p is prime, let Np(f) be the number of zeros of f in Fp = Z/pZ. Theorem 1. Assume (i) n...

متن کامل

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1979

ISSN: 0002-9939

DOI: 10.2307/2042741